@article{Bellert1962,
author = "Bellert, S.",
doi = "10.1016/0016-0032(62)90042-X",
issn = "00160032",
journal = "Journal of the Franklin Institute",
month = "dec",
number = "6",
pages = "425--443",
title = "Topological analysis and synthesis of linear systems",
volume = "274",
year = "1962",
}
@article{Eppstein1992,
author = "Eppstein, David",
doi = "10.1007/BF01994879",
issn = "00063835",
journal = "BIT",
keyword = "F.1.3,F.2.2,G.2.2,I.2.8",
link = "http://link.springer.com/10.1007/BF01994879",
month = "jun",
number = "2",
pages = "237--248",
title = "Finding the k smallest spanning trees",
uri = "http://link.springer.com/10.1007/BF01994879",
volume = "32",
year = "1992",
}
@article{Eppstein1997,
author = "Eppstein, David and Galil, Zvi and Italiano, Giuseppe F. and Nissenzweig, Amnon",
doi = "10.1145/265910.265914",
issn = "00045411",
journal = "Journal of the ACM",
keyword = "dynamic graph algorithms,edge and vertex connectivity,minimum spanning trees",
link = "http://dl.acm.org/citation.cfm?id=265910.265914",
month = "sep",
number = "5",
pages = "669--696",
publisher = "ACM",
title = "Sparsification---A Technique for Speeding Up Dynamic Graph Algorithms",
uri = "http://dl.acm.org/citation.cfm?id=265910.265914",
volume = "44",
year = "1997",
}
@article{Frederickson1985,
author = "Frederickson, Greg N.",
doi = "10.1137/0214055",
isbn = "0897910990",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,a minimum,be maintained for an,connected components,consider the following on-line,data structures,edge insertion and deletion,introduction,k smallest spanning,minimum spanning tree,on-line computation,planar graphs,spanning tree is to,trees,underlying graph,update problem,which is modified repeatedly",
link = "http://epubs.siam.org/doi/abs/10.1137/0214055",
number = "4",
pages = "781--798",
title = "Data Structures for On-Line Updating of Minimum Spanning Trees, With Applications",
uri = "http://epubs.siam.org/doi/abs/10.1137/0214055",
volume = "14",
year = "1985",
}
@article{Fujisawa1959,
author = "Fujisawa, T.",
doi = "10.1109/TCT.1959.1086556",
issn = "0096-2007",
journal = "IRE Transactions on Circuit Theory",
number = "3",
pages = "261--266",
title = "On a Problem of Network Topology",
volume = "6",
year = "1959",
}
@article{Gabow1977,
author = "Gabow, Harold N.",
doi = "10.1137/0206011",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,branch and bound,consider this,edge exchange,electrical wiring problem,for example,graph in order of,in many practical situations,increasing weight,introduction,little wire as,n pins must be,one wants to generate,set merging,spanning trees of a,the,weighted spanning trees,wired together with as",
link = "http://epubs.siam.org/doi/abs/10.1137/0206011",
number = "1",
pages = "139--150",
title = "Two Algorithms for Generating Weighted Spanning Trees in Order",
uri = "http://epubs.siam.org/doi/abs/10.1137/0206011",
volume = "6",
year = "1977",
}
@article{Gabow1978,
author = "Gabow, Harold N. and Myers, Eugene W.",
doi = "10.1137/0207024",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,10,252 364,252-364,4,5,6,7,8,9,algorithms of varying efficiency,algorithms varying efficiency,all spanning trees,all spanning trees of,arborescence,bridge,depth first search,depth-first search,directed,directed and,have been proposed,introduction,networks,pp,problem finding,solution electrical,spanning tree,the problem of finding,the solution of electrical,undirected graphs arises,undirected graphs arises in",
link = "http://epubs.siam.org/doi/abs/10.1137/0207024",
month = "aug",
number = "3",
pages = "280--287",
publisher = "SIAM",
title = "Finding All Spanning Trees of Directed and Undirected Graphs",
uri = "http://epubs.siam.org/doi/abs/10.1137/0207024",
volume = "7",
year = "1978",
}
@article{Gabow1986a,
author = "Gabow, Harold N. and Galil, Zvi and Spencer, Thomas and Tarjan, Robert E.",
doi = "10.1007/BF02579168",
issn = "0209-9683",
journal = "Combinatorica",
link = "http://link.springer.com/10.1007/BF02579168",
month = "jun",
number = "2",
pages = "109--122",
title = "Efficient algorithms for finding minimum spanning trees in undirected and directed graphs",
uri = "http://link.springer.com/10.1007/BF02579168",
volume = "6",
year = "1986",
}
@article{Hakimi1961,
author = "Hakimi, S.L.",
doi = "10.1016/0016-0032(61)90036-9",
issn = "00160032",
journal = "Journal of the Franklin Institute",
link = "http://linkinghub.elsevier.com/retrieve/pii/0016003261900369",
month = "nov",
number = "5",
pages = "347--359",
title = "On trees of a graph and their generation",
uri = "http://linkinghub.elsevier.com/retrieve/pii/0016003261900369",
volume = "272",
year = "1961",
}
@inproceedings{Hariharan1995,
address = "Kingston, Canada",
author = "Hariharan, Ramesh and Kapoor, Sanjiv and Kumar, Vijay",
booktitle = "WADS 1995: the 4th International Workshop on Algorithms and Data Structures",
doi = "10.1007/3-540-60220-8_82",
editor = "Akl, Selim G. and Dehne, Frank and Sack, J\"{o}rg-R\"{u}diger and Santoro, Nicola",
link = "http://link.springer.com/chapter/10.1007/3-540-60220-8_82",
month = "aug",
pages = "428--439",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Faster enumeration of all spanning trees of a directed graph",
uri = "http://link.springer.com/chapter/10.1007/3-540-60220-8_82",
volume = "955",
year = "1995",
}
@article{Jayakumar1984,
author = "Jayakumar, R. and Thulasiraman, K. and Swamy, M.",
doi = "10.1109/TCS.1984.1085435",
issn = "0098-4094",
journal = "IEEE Transactions on Circuits and Systems",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1085435",
month = "oct",
number = "10",
pages = "853--860",
title = "Complexity of computation of a spanning tree enumeration algorithm",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1085435",
volume = "31",
year = "1984",
}
@inproceedings{Kapoor1991,
address = "Ottawa, Canada",
author = "Kapoor, Sanjiv and Ramesh, H",
booktitle = "WADS 1991: the 2nd Workshop on Algorithms and Data Structures",
doi = "10.1007/BFb0028284",
editor = "Dehne, Frank and Sack, J\"{o}rg-R\"{u}diger and Santoro, Nicola",
link = "http://link.springer.com/chapter/10.1007/BFb0028284",
month = "aug",
pages = "461--472",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Algorithms for generating all spanning trees of undirected, directed and weighted graphs",
uri = "http://link.springer.com/chapter/10.1007/BFb0028284",
volume = "519",
year = "1991",
}
@article{Kapoor1995,
author = "Kapoor, Sanjiv and Ramesh, H",
doi = "10.1137/S009753979225030X",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "enumeration,spanning tree,undirected graph,weighted graph",
link = "http://epubs.siam.org/doi/abs/10.1137/S009753979225030X",
month = "apr",
number = "2",
pages = "247--265",
title = "Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs",
uri = "http://epubs.siam.org/doi/abs/10.1137/S009753979225030X",
volume = "24",
year = "1995",
}
@article{Kapoor2000,
author = "Kapoor, S. and Ramesh, H.",
doi = "10.1007/s004530010008",
isbn = "0045300100",
issn = "0178-4617",
journal = "Algorithmica",
month = "jun",
number = "2",
pages = "120--130",
title = "An Algorithm for Enumerating All Spanning Trees of a Directed Graph",
volume = "27",
year = "2000",
}
@article{Katoh1981,
author = "Katoh, N. and Ibaraki, T. and Mine, H.",
doi = "10.1137/0210017",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,and e is a,associated with each edge,be an undirected connected,computational complexity,e,e e,edges,graph algorithm,graph with no parallel,introduction,is,kth minimum spanning tree,let g,problem is to find,set of m edges,set of n vertices,the,the minimum spanning tree,the weight w,v,where v is a",
link = "http://epubs.siam.org/doi/abs/10.1137/0210017",
number = "2",
pages = "247--255",
title = "Minimum Spanning Trees",
uri = "http://epubs.siam.org/doi/abs/10.1137/0210017",
volume = "10",
year = "1981",
}
@article{MacWilliams1958,
author = "MacWilliams, J.",
doi = "10.1109/TCT.1958.1086460",
issn = "00962007",
journal = "IRE Transactions on Circuit Theory",
number = "3",
pages = "228--229",
title = "Topological Network Analysis as a Computer Program",
volume = "5",
year = "1958",
}
@article{Mai1984,
author = "Mai, Shao-Wen and Evans, D.J.",
doi = "10.1016/S0167-8191(84)90197-2",
issn = "01678191",
journal = "Parallel Computing",
month = "dec",
number = "3-4",
pages = "275--286",
title = "A parallel algorithm for the enumeration of the spanning trees of a graph",
volume = "1",
year = "1984",
}
@article{Matsui1997,
author = "Matsui, T.",
doi = "10.1007/PL00009171",
issn = "0178-4617",
journal = "Algorithmica",
link = "http://link.springer.com/10.1007/PL00009171",
month = "aug",
number = "4",
pages = "530--543",
title = "A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs",
uri = "http://link.springer.com/10.1007/PL00009171",
volume = "18",
year = "1997",
}
@article{Maxwell1966,
author = "Maxwell, L.M. and Cline, J.M.",
doi = "10.1049/piee.1966.0224",
issn = "00203270",
journal = "Proceedings of the Institution of Electrical Engineers",
number = "8",
pages = "1344",
title = "Topological network analysis by algebraic methods",
volume = "113",
year = "1966",
}
@article{Mayeda1965a,
author = "Mayeda, W. and Seshu, S.",
doi = "10.1109/TCT.1965.1082432",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
keyword = "Application software,Application specific integrated circuits,Circuit theory,Computer networks,Graph theory,Military computing,Transfer functions,Transformers,Tree graphs",
language = "English",
link = "http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=1082432 http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082432",
month = "jun",
number = "2",
pages = "181--185",
publisher = "IEEE",
title = "Generation of Trees without Duplications",
uri = "http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=1082432",
volume = "12",
year = "1965",
}
@article{Mayr1992,
author = "Mayr, Ernst W and Plaxton, C Greg",
doi = "10.1007/BF01305236",
issn = "02099683",
journal = "Combinatorica",
keyword = "05C85,68R10,AMS subject classification code (1991): 05C05",
link = "http://link.springer.com/article/10.1007/BF01305236",
number = "4",
pages = "433--447",
title = "On the spanning trees of weighted graphs",
uri = "http://link.springer.com/article/10.1007/BF01305236",
volume = "12",
year = "1992",
}
@article{McIlroy1969,
author = "McIlroy, M. Douglas",
doi = "10.1145/363219.363229",
issn = "00010782",
journal = "Communications of the ACM",
month = "sep",
number = "9",
pages = "511",
title = "Algorithm 354: generator of spanning trees [H]",
volume = "12",
year = "1969",
}
@article{Minty1965,
author = "Minty, George J.",
doi = "10.1109/TCT.1965.1082385",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
link = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1082385",
number = "1",
pages = "120",
title = "A Simple Algorithm for Listing All the Trees of a Graph",
uri = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1082385",
volume = "12",
year = "1965",
}
@article{Percival1953,
author = "Percival, W S",
doi = "10.1049/pi-3.1953.0033",
journal = "Proceedings of the IEE - Part III: Radio and Communication Engineering",
number = "65",
pages = "143--150",
title = "The solution of passive electrical networks by means of mathematical trees",
volume = "100",
year = "1953",
}
@article{Piekarski1965,
author = "Piekarski, M.",
doi = "10.1109/TCT.1965.1082388",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
number = "1",
pages = "124--125",
title = "Listing of All Possible Trees of a Linear Graph",
volume = "12",
year = "1965",
}
@article{Read1975,
author = "Read, Ronald C. and Tarjan, Robert Endre",
journal = "Networks",
link = "http://scholar.google.com/scholar?hl=en{\&}btnG=Search{\&}q=intitle:Bounds+on+backtrack+algorithms+for+listing+cycles,+paths,+and+Spanning+trees.\#0",
number = "3",
pages = "237--252",
title = "Bounds on backtrack algorithms for listing cycles, paths, and spanning trees",
uri = "http://scholar.google.com/scholar?hl=en{&}btnG=Search{&}q=intitle:Bounds+on+backtrack+algorithms+for+listing+cycles,+paths,+and+Spanning+trees.#0",
volume = "5",
year = "1975",
}
@article{Shioura1995,
author = "Shioura, Akiyoshi and Tamura, Akihisa",
doi = "10.1.1.30.4555",
journal = "Journal of the Operations Research Society of Japan",
link = "http://www.orsj.or.jp/~archive/menu/01_38.html\#vol3",
number = "3",
pages = "331--344",
title = "Efficiently Scanning all Spanning Trees of an Undirected Graph",
uri = "http://www.orsj.or.jp/~archive/menu/01_38.html#vol3",
volume = "38",
year = "1995",
}
@article{Shioura1997,
author = "Shioura, Akiyoshi and Tamura, Akihisa and Uno, Takeaki",
doi = "10.1137/S0097539794270881",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "05C30,68R10,optimal algorithm,spanning trees,undirected graphs",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/S0097539794270881?journalCode=smjcat",
month = "jun",
number = "3",
pages = "678--692",
publisher = "Society for Industrial and Applied Mathematics",
title = "An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs",
uri = "http://epubs.siam.org/doi/abs/10.1137/S0097539794270881?journalCode=smjcat",
volume = "26",
year = "1997",
}
@article{Sorensen2005,
author = "S\"{o}rensen, Kenneth and Janssens, Gerrit K.",
doi = "10.1590/S0101-74382005000200004",
issn = "0101-7438",
journal = "Pesquisa Operacional",
link = "http://www.scielo.br/scielo.php?script=sci_arttext\&pid=S0101-74382005000200004\&lng=en\&nrm=iso\&tlng=en",
month = "aug",
number = "2",
pages = "219--229",
publisher = "SOBRAPO",
title = "An algorithm to generate all spanning trees of a graph in order of increasing cost",
uri = "http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382005000200004&lng=en&nrm=iso&tlng=en",
volume = "25",
year = "2005",
}
@inproceedings{Uno1996,
address = "Osaka, Japan",
author = "Uno, Takeaki",
booktitle = "ISAAC 1996: the 7th International Symposium on Algorithms and Computation",
doi = "10.1007/BFb0009492",
editor = "Asano, Tetsuo and Igarashi, Yoshihide and Nagamochi, Hiroshi and Miyano, Satoru and Suri, Subhash",
keyword = "directed spanning tree,enumerating algorithm,listing",
link = "http://link.springer.com/chapter/10.1007/BFb0009492",
month = "dec",
pages = "166--173",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "An algorithm for enumerating all directed spanning trees in a directed graph",
uri = "http://link.springer.com/chapter/10.1007/BFb0009492",
volume = "1178",
year = "1996",
}
@inproceedings{Uno1998a,
address = "Taejon, Korea",
author = "Uno, Takeaki",
booktitle = "ISAAC 1998: the 9th International Symposium on Algorithms and Computation",
doi = "10.1007/3-540-49381-6_31",
editor = "Chwa, Kyung-Yong and Ibarra, Oscar H.",
link = "http://link.springer.com/chapter/10.1007/3-540-49381-6_31",
month = "dec",
pages = "287--296",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "New Approach for Speeding Up Enumeration Algorithms",
uri = "http://link.springer.com/chapter/10.1007/3-540-49381-6_31",
volume = "1533",
year = "1998",
}
@article{Watanabe1960,
author = "Watanabe, H.",
doi = "10.1109/TCT.1960.1086675",
issn = "0096-2007",
journal = "IRE Transactions on Circuit Theory",
number = "3",
pages = "296--302",
title = "A Computational Method for Network Topology",
volume = "7",
year = "1960",
}
@article{Winter1986,
author = "Winter, Pawel",
doi = "10.1007/BF01939361",
issn = "0006-3835",
journal = "BIT",
keyword = "master thesis",
link = "http://link.springer.com/10.1007/BF01939361",
month = "mar",
number = "1",
pages = "44--62",
title = "An algorithm for the enumeration of spanning trees",
uri = "http://link.springer.com/10.1007/BF01939361",
volume = "26",
year = "1986",
}
@article{Yamada2010,
author = "Yamada, Takeo and Kataoka, Seiji and Watanabe, Kohtaro",
doi = "10.1080/00207160903329699",
issn = "0020-7160",
journal = "International Journal of Computer Mathematics",
keyword = "05c05,05c30,2000 ams classifications,68w05,enumeration algorithm,minimum spanning tree",
link = "http://www.tandfonline.com/doi/abs/10.1080/00207160903329699",
month = "nov",
number = "14",
pages = "3175--3185",
title = "Listing All the Minimum Spanning Trees in an Undirected Graph",
uri = "http://www.tandfonline.com/doi/abs/10.1080/00207160903329699",
volume = "87",
year = "2010",
}